Polynomial induction and length minimization in intuitionistic bounded arithmetic
نویسنده
چکیده
It is shown that the feasibly constructive arithmetic theory IPV does not prove (double negation of) LMIN(NP), unless the polynomial hierarchy CPV-provably collapses. It is proved that PV plus (double negation of) LMIN(NP) intuitionistically proves PIND(coNP). It is observed that PV+ PIND(NP∪coNP) does not intuitionistically prove NPB, a scheme which states that the extended Frege systems are not polynomially bounded. 2000 Mathematics Subject Classification: 03F30, 03F55, 03F50, 68Q15.
منابع مشابه
Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
In this note we show that the intuitionistic theory of polynomial induction on Π 1 -formulas does not imply the intuitionistic theory IS 1 2 of polynomial induction on Σ 1 -formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for length induction in place of polynomial induction. We also investigate the relation between various other...
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملPreservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملModel theory of bounded arithmetic with applications to independence results
In this paper we apply some new and some old methods in order to construct classical and intuitionistic models for theories of bounded arithmetic. We use these models to obtain proof theoretic consequences. In particular, we construct an ωchain of models of BASIC such that the union of its worlds satisfies S2 but none of its worlds satisfies the sentence ∀x∃y(x = 0 ∨ x = y + 1). Interpreting th...
متن کاملAn Independence Result for Intuitionistic Bounded Arithmetic
It is shown that the intuitionistic theory of polynomial induction on positive Π1 (coNP) formulas does not prove the sentence ¬¬∀x, y∃z ≤ y(x ≤ |y| → x = |z|). This implies the unprovability of the scheme ¬¬PIND(Σ 1 ) in the mentioned theory. However, this theory contains the sentence ∀x, y¬¬∃z ≤ y(x ≤ |y| → x = |z|). The above independence result is proved by constructing an ω-chain of submode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 51 شماره
صفحات -
تاریخ انتشار 2005